Device trees everywhere
نویسنده
چکیده
We present a method for booting a PowerPC r © Linux r © kernel on an embedded machine. To do this, we supply the kernel with a compact attened-tree representation of the system's hardware based on the device tree supplied by Open Firmware on IBM r © servers and Apple r © Power Macintosh r © machines. The blob representing the device tree can be created using dtc the Device Tree Compiler that turns a simple text representation of the tree into the compact representation used by the kernel. The compiler can produce either a binary blob or an assembler le ready to be built into a rmware or bootwrapper image. This attened-tree approach is now the only supported method of booting a ppc64 kernel without Open Firmware, and we plan to make it the only supported method for all powerpc kernels in the future.
منابع مشابه
Series-Parallel Networks
Series and parallel connections are usually first encountered in the study of electrical circuits. Our approach is to first examine a relevant class of partially ordered sets (posets) and then to define series-parallel networks by analogy [1]. Interesting asymptotic constants appear everywhere, similar to those associated with counting various species of trees [2]. We also talk briefly about th...
متن کاملModel Selection in Omnivariate Decision Trees
We propose an omnivariate decision tree architecture which contains univariate, multivariate linear or nonlinear nodes, matching the complexity of the node to the complexity of the data reaching that node. We compare the use of different model selection techniques including AIC, BIC, and CV to choose between the three types of nodes on standard datasets from the UCI repository and see that such...
متن کاملStatistics of delta peaks in the spectral density of large random trees
We present an analysis of the spectral density of the adjacency matrix of large random trees. We show that there is an infinity of delta peaks at all real numbers which are eigenvalues of finite trees. By exact enumerations and Monte-Carlo simulations, we have numerical estimations of the heights of peaks. In the large tree limit, the sum of their heights is 0.19173 ± 0.00005. Moreover all asso...
متن کاملOn Gromov Hyperbolicity and a Characterization of Real Trees
Our argument relies on the well-known fact that Lipschitz maps from Euclidean space into metric spaces have metric derivatives almost everywhere, as proved by Kirchheim [Kir] and Korevaar-Schoen [KoSc] independently. We can combine the main result of [ChNi], a characterization of Gromov hyperbolicity via asymptotic cones [Dru], and Theorem 1.1 to obtain a partial generalization of Chatterji and...
متن کاملHarmonic functions on hyperbolic graphs
We consider admissible random walks on hyperbolic graphs. For a given harmonic function on such a graph, we prove that asymptotic properties of non-tangential boundedness and non-tangential convergence are almost everywhere equivalent. The proof is inspired by the works of F. Mouton in the cases of Riemannian manifolds of pinched negative curvature and infinite trees. It involves geometric and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006